Most probable explanations in Bayesian networks: Complexity and tractability
نویسندگان
چکیده
منابع مشابه
Most probable explanations in Bayesian networks: Complexity and tractability
An overview is given of definitions and complexity results of a number of variants of the problem of probabilistic inference of the most probable explanation of a set of hypotheses given observed phenomena.
متن کاملTractability of most probable explanations in multidimensional Bayesian network classifiers
Multidimensional Bayesian network classifiers have gained popularity over the last few years due to their expressive power and their intuitive graphical representation. A drawback of this approach is that their use to perform multidimensional classification, a generalization of multi-label classification, can be very computationally demanding when there are a large number of class variables. Th...
متن کاملStructure Approximation of Most Probable Explanations in Bayesian Networks
Abstract Typically, when one discusses approximation algorithms for (NP-hard) problems (like TRAVELING SALESPERSON, VERTEX COVER, KNAPSACK), one refers to algorithms that return a solution whose value is (at least ideally) close to optimal; e.g., a tour with almost minimal length, a vertex cover of size just above minimal, or collection of objects that has close to maximal value. In contrast, o...
متن کاملMost frugal explanations in Bayesian networks
Inferring the most probable explanation to a set of variables, given a partial observation of the remaining variables, is one of the canonical computational problems in Bayesian networks, with widespread applications in AI and beyond. This problem, known as MAP, is computationally intractable (NP-hard) and remains so even when only an approximate solution is sought. We propose a heuristic formu...
متن کاملA Computational Model of Motor Areas Based on Bayesian Networks and Most Probable Explanations
We describe a computational model of motor areas of the cerebral cortex. The model combines Bayesian networks, competitive learning and reinforcement learning. We found that decision-making using MPE (Most Probable Explanation) approximates the ideal decisionmaking in this model, which suggests that MPE calculation is a promising model of not only sensory-cortex recognition, already addressed b...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Approximate Reasoning
سال: 2011
ISSN: 0888-613X
DOI: 10.1016/j.ijar.2011.08.003